Secure computation system, secure computation device, secure computation method, and program

ABSTRACT

Fisher&#39;s exact test is efficiently computed through secure computation. It is assumed that a, b, c and d are frequencies of a 2×2 contingency table, [a], [b], [c] and [d] are secure texts of the respective frequencies a, b, c and d, and N is an upper bound satisfying a+b+c+d≤N. A reference frequency computation part  12  computes a secure text ([a 0 ], [b 0 ], [c 0 ], [d 0 ]) of a combination of reference frequencies (a 0 , b 0 , c 0 , d 0 ) which are integers satisfying a 0 +b 0 =a+b, c 0 +d 0 =c+d, a 0 +c 0 =a+c, and b 0 +d 0 =b+d. A number-of-patterns determination part  13  determines integers h 0  and h 1  satisfying h 0 ≤h 1 . A pattern computation part  14  computes [ai]=[a 0 ]+i, [b i ]=[b 0 ]−i, [c i ]=[c 0 ]−i and [d i ]=[d 0 ]+i for i=h 0 , . . . , h 1 , and obtains a set S={([a i ], [b i ], [c i ], [d i ])} i  of secure texts of combinations of frequencies (a i , b i , c i , d i ).

TECHNICAL FIELD

The present invention relates to applied cryptographic technology and, in particular, to technology of computing Fisher's exact test without disclosing input data.

BACKGROUND ART

Fisher's exact test has been widely known as one of statistical test methods that perform a hypothesis test on the presence or absence of an association between explanatory variables and response variables provided as a 2×2 contingency table. Non-patent literature 1 describes the genome-wide association study (GWAS) as a usage example of Fisher's exact test.

Fisher's exact test is described. The following table is an example of a 2×2 contingency table where n subjects are classified and counted according to the presence or absence of mutation and the presence or absence of the onset of a predetermined disease.

With Without Subtotal due mutation mutation to disease With disease a b n_(1•) Without disease c d n_(2•) Subtotal due to n_(•1) n_(•2) n mutation a, b, c and d represent frequencies. n_(1•), n_(2•), n_(•1) and n_(•2) represent subtotals. n_(1•)=a+b, n_(2•)=c+d, n_(•1)=a+c, n_(•2)=b+d. All of a, b, c, d, n_(1•), n_(2•), n_(•1) and n_(•2) are non-negative integers.

Here, for a non-negative integer i, the probability p, defined by an equation (1) is computed. According to the magnitude relationship between the sum of probabilities p represented by an equation (2) and a predetermined value α, which is called a significance level, the presence or absence of association between explanatory variables (the presence or absence of mutation in the above table) and response variables (the presence or absence of the disease in the above table) is tested. Here, p_(a) is a probability value computed by the equation (1) about the contingency table where actual aggregation values a, b, c and d are adopted as frequencies.

$\begin{matrix} {p_{i} = \frac{{\left( {a + b} \right)!}{\left( {c + d} \right)!}{\left( {a + c} \right)!}{\left( {b + d} \right)!}}{{i!}{\left( {a + b - i} \right)!}{\left( {a + c - i} \right)!}{\left( {d - a + i} \right)!}{\left( {a + b + c + d} \right)!}}} & (1) \\ {p = {\sum\limits_{{i\mspace{14mu} {s.t}\mspace{14mu} p_{i}} \leq p_{a}}p_{i}}} & (2) \end{matrix}$

Methods of obtaining specific operation results without decrypting encrypted numerical values include a method called secure computation (see Non-patent literature 2, for example). The method of Non-patent literature 2 performs encryption that allows three secure computation devices to hold the divided fragments of the numerical value, and the three secure computation devices perform cooperative computation, which can allow the three secure computation devices to hold the results of addition and subtraction, constant addition, multiplication, constant multiplication, logical operation (negation, logical multiplication, logical addition, and exclusive OR), and data notation conversion (integer, and binary numeral) without decrypting the numerical value, in a state of being distributed among the three secure computation devices, i.e., being left encrypted.

There is a conventional research that performs genome-wide association study while keeping genome information secret using cryptographic technology, in consideration of the sensitivity and secrecy of the genome information (see Non-patent literature 3, for example). Non-patent literature 3 proposes a method of performing a chi-square test while keeping genome information secret.

PRIOR ART LITERATURE Non-Patent Literature

-   Non-patent literature 1: Konrad Karczewski, “How to do a GWAS”,     Lecture note in GENE 210: Genomics and Personalized Medicine, 2015. -   Non-patent literature 2: Koji Chida, Koki Hamada, Dai Ikarashi, and     Katsumi Takahashi, “A Three-Party Secure Function Evaluation with     Lightweight Verifiability Revisited”, CSS 2010, 2010. -   Non-patent literature 3: Yihua Zhang, Marina Blanton, and Ghada     Almashaqbeh, “Secure distributed genome analysis for gwas and     sequence comparison computation”, BMC medical informatics and     decision making, Vol. 15, No. Suppl 5, p. S4, 2015.

SUMMARY OF THE INVENTION Problems to be Solved by the Invention

However, according to the conventional art, for computation of each probability p_(i), it is assumed that a_(i)=i, b_(i)=b+a−i, c_(i)=c+a−i, and d_(i)=d−a+i, it is also assumed that the maximum i with b_(i)≥0 and c_(i)≥0 is i₁ and it is also assumed that the minimum i with a_(i)≥0 and d_(i)≥0 is i₀, and then p_(i) is computed for each i that satisfies i₀≤i≤i₁. Here, the number of combinations of frequencies (a_(i), b_(i), c_(i) and d_(i)) to be computed is identified based on the values of i₀ and i₁. The number can be used for information for estimating input values a, b, c and d. Accordingly, secure texts {([a_(i)], [b_(i)], [c_(i)] and [d_(i)])}_(i) of the combination of frequencies (a_(i), b_(i), c_(i) and d_(i)) to be computed cannot be obtained while keeping the input secret.

In view of the above point, the secure computation technology of the present invention has an object to compute Fisher's exact test efficiently through secure computation.

Means to Solve the Problems

To solve the above problems, the secure computation system of the present invention is a secure computation system comprising three or more secure computation devices, wherein it is assumed that a, b, c and d are non-negative integers, a is a frequency on a first row and a first column of a 2×2 contingency table, b is a frequency on the first row and a second column of the contingency table, c is a frequency on a second row and the first column of the contingency table, d is a frequency on the second row and the second column of the contingency table, [a], [b], [c] and [d] are secure texts of the respective frequencies a, b, c and d, and N is an upper bound satisfying a+b+c+d, the secure computation device comprises: a reference frequency computation part that computes a secure text ([a₀], [b₀], [c₀], [d₀]) of a combination of reference frequencies (a₀, b₀, c₀, d₀) which are integers satisfying a₀+b₀=a+b, c₀+d₀=c+d, a₀+c₀=a+c, and b₀+d₀=b+d; a number-of-patterns determination part that determines integers h₀ and h_(i) satisfying h₀≤h₁; and a pattern computation part that computes [a_(i)]=[a₀]+i, [b_(i)]=[b₀]−i, [c_(i)]=[c₀]−i and [d_(i)]=[d₀]+i for i=h₀, . . . , h_(i), and obtains a set S={([a_(i)], [b_(i)], [c_(i)], [d_(i)])}_(i) of secure texts of combinations of frequencies (a_(i), b_(i), c_(i), d_(i)).

Effects of the Invention

The present invention can enumerate the combinations of frequencies (a_(i), b_(i), c_(i), d_(i)) while reducing the number of elements of the set S={([a_(i)], [b_(i)], [c_(i)], [d_(i)])}_(i) of secure texts to be output, without disclosing the number of combinations of frequencies (a_(i), b_(i), c_(i), d_(i)) which are computation targets of Fisher's exact test. Consequently, Fisher's exact test can be efficiently computed through secure computation. Specifically, the effects of reducing the amount of use of computational resources and of reducing the processing time to about ½ can be expected. Furthermore, Fisher's exact test can be executed, with the genome information being kept secret. That is, for example, execution results of Fisher's exact test on integrated data can be obtained while genome data items held by multiple research institutes are kept secret and are not disclosed to each other, an execution environment for genome analysis having a significantly high security level can be provided, and further development in healthcare can be expected accordingly.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a diagram exemplifying a functional configuration of a secure computation system;

FIG. 2 is a diagram exemplifying a functional configuration of a secure computation device; and

FIG. 3 is a diagram exemplifying processing procedures of a secure computation method.

DETAILED DESCRIPTION OF THE EMBODIMENTS

Prior to the description of embodiments, the notation scheme in this Description is described.

<Notation>

A value secured by applying encryption or secret sharing to a certain value “a” is called the secure text of “a” and is represented as [a]. Meanwhile, “a” is called the plain text of [a]. In a case where the securing is secret sharing, a set of the secret sharing fragments held by the individual parties according to [a] is referred to.

Hereinafter, embodiments of the present invention are described in detail. In the diagrams, configuration parts having the same functions are assigned the same numerals, and redundant description thereof is omitted.

First Embodiment

A secure computation system of a first embodiment comprises n (≥3) secure computation devices 1 ₁, . . . , 1 _(n), as exemplified in FIG. 1. In this embodiment, the secure computation devices 1 ₁, . . . , 1 _(n) are each connected to a communication network 2. The communication network 2 is a communication network that is of a circuit switching scheme or a packet switching scheme and is configured to allow the secure computation devices 1 ₁, . . . , 1 _(n) to communicate with each other. For example, the Internet, a LAN (Local Area Network), a WAN (Wide Area Network) or the like may be used. Each device is not necessarily capable of communicating online via the communication network 2. For example, it may be configured such that information to be input into the secure computation devices 1 _(i) (iε{1, . . . , n}) may be stored in a portable recording medium, such as magnetic tape or a USB memory, and input may be performed offline from the portable recording medium.

As exemplified in FIG. 2, the secure computation device 1 includes an input part 11, a reference frequency computation part 12, a number-of-patterns determination part 13, a pattern computation part 14, and an output part 15. The secure computation device 1 performs the process of each step exemplified in FIG. 3, thereby achieving a secure computation method of the first embodiment.

The secure computation device 1 is, for example, a special device configured to include a publicly known or dedicated computer which includes a central processing unit (CPU) and a main memory (RAM: Random Access Memory) and the like and into which a special program has been read. The secure computation device 1 executes each process under control by the central processing unit, for example. Data input into the secure computation device 1 and data obtained by each process are stored in the main memory, for example. The data stored in the main memory is read into the central processing unit as required, and is used for another process. At least some of the processing parts of the secure computation device 1 may be configured by hardware, such as an integrated circuit.

Referring to FIG. 3, the processing procedures of the secure computation method of the first embodiment are described.

In step S11, a secure text ([a], [b], [c], [d]) of a combination of frequencies (a, b, c, d) in a 2×2 contingency table, and an upper bound N that satisfies a+b+c+d≤T are input into the input part 11. Here, the 2×2 contingency table is defined by the following formulae, and a, b, c and d are non-negative integers.

Without Subtotal due With event 1 event 1 to event 2 With event 2 a b n_(1•) Without event 2 c d n_(2•) Subtotal due to n_(•1) n_(•2) n event 1

In step S12, the reference frequency computation part 12 uses the secure text ([a], [b], [c], [d]) of the combination of the frequencies (a, b, c, d) to compute a secure text ([a₀], [b₀], [c₀], [d₀]) of a combination of integers (a₀, b₀, c₀, d₀) satisfying the following equations. Hereinafter, a₀, b₀, c₀ and d₀ are called reference frequencies

a ₀ +b ₀ =a+b,

c ₀ ±d ₀ =c+d,

a ₀ +c ₀ =a+c,

b ₀ +d ₀ =b+d

For example, the reference frequency computation part 12 may compute the following equations to obtain the secure text ([a₀], [b₀], [c₀], [d₀]) of the combination of the reference frequencies (a₀, b₀, c₀, d₀).

[a ₀]=0,

[b ₀]=[b]+[a],

[c ₀]=[c]+[a],

[d ₀]=[d]−[a]

In step S13, the number-of-patterns determination part 13 determines integers h₀ and h₁ that satisfy h₀≤h₁. Here, it is determined such that h₀=0, and h₁=N, for example.

In step S14, the pattern computation part 14 computes the following equations for each integer i ranging from h₀ to h₁, inclusive, to obtain the secure text ([a_(i)], [b_(i)], [c_(i)], [d_(i)]) of the combination of frequencies (a_(i), b_(i), c_(i), d_(i)).

[a _(i)]=[a ₀]+i,

[b _(i)]=[b ₀]−i,

[c _(i)]=[c ₀]−i,

[d _(i)]=[d ₀]+i

In step S15, a set S={([a_(i)], [b_(i)], [c_(i)], [d_(i)])}_(i=h0, . . . , h1) of secure texts of the combinations of (h₁−h₀+1) frequencies (a_(i), b_(i), c_(i), d_(i)) is output from the output part 15.

The set S is a set where only one jε{h₀, . . . , h₁} resides that satisfies a′=a_(j), b′=b_(j), c′=c_(j) and d′=d_(j) for every combination of integers (a′, b′, c′, d′) satisfying a′≥0, b′≥0, c′≥0, d′≥0, a′+b′=a+b, c′+d′=c+d, a′+c′=a+c and b′+d′=b+d. That is, the set mutually exclusively includes all combinations of non-negative integers with values varying so as not to change the subtotals in the contingency table, for given a, b, c and d. Here, the set S may include combinations of integers (that may include negative integers) with each subtotal being the same in the contingency table.

According to the secure computation technology of the first embodiment, the number of secure texts of the combinations of frequencies included in the output set S is determined by the disclosed value N. Consequently, the given frequencies a, b, c and d cannot be estimated. Accordingly, the combinations of frequencies which are computation targets of the Fisher's exact test can be enumerated, with the input being kept secret.

Second Embodiment

Referring to FIG. 3, the processing procedures of the secure computation method of a second embodiment are described. Hereinafter, differences from the first embodiment described above are mainly described.

In step S12, the reference frequency computation part 12 computes [e]=min([a], [d]). Here min(•) is a function of outputting the minimum value among the arguments. That is, [a] and [d] are compared with each other with the values being kept secret, and secure text of the smaller value is regarded as [e]. Subsequently, the reference frequency computation part 12 computes the following equations to obtain the secure text ([a₀], [b₀], [c₀], [d₀]) of the combination of the reference frequencies (a₀, b₀, c₀, d₀).

[a ₀]=[a]−[e],

[b ₀]=[b]+[e],

[c ₀]=[c]+[e],

[d ₀]=[d]−[e]

In step S13, the number-of-patterns determination part 13 computes h₀=0 and h₁=floor(N/2) to determine the integers h₀ and h₁. Here, floor(•) is a floor function for outputting the maximum integer equal to or less than •. That is, h₁ can be represented by the following equation.

$h_{1} = \left\lfloor \frac{N}{2} \right\rfloor$

In step S14, the pattern computation part 14 uses the secure text [a₀], [b₀], [c₀], [d₀]) of the combination of the reference frequencies (a₀, b₀, c₀, d₀) and the integers h₀ and h₁ obtained as described above to obtain the secure text ([a_(i)], [b_(i)], [c_(i)], [d_(i)]) of the combination of frequencies (a_(i), b_(i), c_(i), d_(i)), as with the first embodiment.

According to the secure computation technology of the second embodiment, the number of secure texts of the combinations of frequencies included in the output set S is determined by the disclosed value N, as with the first embodiment. Consequently, the given frequencies a, b, c and d cannot be estimated. In comparison with the first embodiment, the number of secure texts of the combination of the frequencies included in the set S decreases. Consequently, Fisher's exact test can be more efficiently computed.

According to the configuration as described above, the secure computation technology of the present invention can enumerate all the combinations of frequencies which are to be computed, without disclosing the number of combinations of the frequencies (a, b, c, d) which are to be computed, and can efficiently compute Fisher's exact test through secure computation without disclosing the input information.

The embodiments of the present invention have thus been described above. However, the specific configuration is not limited to that in these embodiments. Even if the design is appropriately changed in a range without departing from the spirit of the present invention, it is a matter of course that the configuration is included in the present invention. The various processes described in the embodiments can be executed in a time-series manner according to the order of the description. Alternatively, such execution may be performed in parallel or individually, in conformity with the processing capability of the device that executes the processes, or as required.

[Program and Recording Medium]

In the cases where the various processing functions in each device described in the embodiments are implemented with a computer, the processing content of the functions that each device should have is described as a program. The program is executed by the computer, thereby achieving the various processing functions in each device described above on the computer.

The program that describes the processing content can be preliminarily recorded in a computer-readable recording medium. The computer-readable recording medium may be, for example, any computer-readable recording medium, such as a magnetic recording device, an optical disk, a magneto-optical recording medium, or a semiconductor memory.

The program is distributed by, for example, selling, transferring, or lending a portable recording medium, such as DVD or CD-ROM, where the program is recorded. Alternatively, a configuration may be adopted where the program may be preliminarily stored in a storing device of a server computer, and the program may be transferred from the server computer to another computer via a network, thereby distributing the program.

For example, the computer for executing such a program, first, stores the program recorded in a portable recording medium or transferred from a server computer, temporarily in its storing device. At the time of executing the process, the computer reads the program recorded in its recording medium, and executes the processes according to the read program. According to another execution mode of this program, the computer may directly read the program from the portable recording medium, and execute the processes according to the program. Further alternatively, every time the program is transferred to the computer from the server computer, the computer may successively execute the process according to the received program. Another configuration may be adopted that executes the processes described above through a service of what is called an ASP (Application Service Provider) type according to which the program is not transferred from the server computer to the computer concerned, and the processing function is achieved only by an execution instruction therefor and acquisition of the result. The program according to the embodiments include information that is provided for the processes by the computer and conforms to the program (data and the like that are not direct instructions to the computer but have characteristics defining the processes of the computer).

According to the embodiments, this device is thus configured by executing a predetermined program on the computer. Alternatively, at least a part of the processing content may be achieved as hardware.

INDUSTRIAL APPLICABILITY

As is obvious from the result of application to the genome-wide association study described above, the secure computation technology of the present invention is applicable to execution of Fisher's exact test through secure computation with information on an aggregate table being kept secret, in analysis using Fisher's exact test, for example, genome-wide association study, genome analysis, clinical research, social investigation, academic research, analysis of examination results, marketing research, statistical computation, medical information analysis, customer information analysis, and sales analysis. 

1. A secure computation system comprising three or more secure computation devices, wherein it is assumed that a, b, c and d are non-negative integers, a is a frequency on a first row and a first column of a 2×2 contingency table, b is a frequency on the first row and a second column of the contingency table, c is a frequency on a second row and the first column of the contingency table, d is a frequency on the second row and the second column of the contingency table, [a], [b], [c] and [d] are secure texts of the respective frequencies a, b, c and d, and N is an upper bound satisfying a+b+c+d≤N, the secure computation device comprises circuitry configured to: compute a secure text ([a₀], [b₀], [c₀], [d₀]) of a combination of reference frequencies (a₀, b₀, c₀, d₀) which are integers satisfying a₀+b₀=a+b, c₀+d₀=c+d, a₀+c₀=a+c, and b₀+d₀=b+d, determine integers h₀ and h₁ satisfying h₀≤h₁; and compute [a_(i)]=[a₀]+i, [b_(i)]=[b₀]−i, [c_(i)]=[c₀]−i and [d_(i)]=[d₀]+i for i=h₀, . . . , h₁, and obtain a set S={([a_(i)], [b_(i)], [c_(i)], [d_(i)])}_(i) of secure texts of combinations of frequencies (a_(i), b_(i), c_(i), d_(i)).
 2. The secure computation system according to claim 1, wherein the circuitry computes [a₀]=0, [b₀]=[b]+[a], [c₀]=[c]+[a] and [d₀]=[d]−[a], obtains the secure text ([a₀], [b₀], [c₀], [d₀]), and determines h₀=0, and h₁=N.
 3. The secure computation system according to claim 1, wherein min(•) represents a minimum value among arguments •, and floor(•) represents a maximum integer equal to or less than a value •, the circuitry computes [e]=min([a], [d]), computes [a₀]=[a]−[e], [b₀]=[b]+[e], [c₀]=[c]+[e] and [d₀]=[d]−[e], obtains the secure text ([a₀], [b₀], [c₀], [d₀]), and determines that h₀=0, h₁=floor(N/2).
 4. The secure computation system according to any one of claims 1 to 3, wherein the contingency table is genome information obtained by classifying and counting according to presence or absence of mutation and presence or absence of an onset of a disease.
 5. A secure computation device, wherein it is assumed that a, b, c and d are non-negative integers, a is a frequency on a first row and a first column of a 2×2 contingency table, b is a frequency on the first row and a second column of the contingency table, c is a frequency on a second row and the first column of the contingency table, d is a frequency on the second row and the second column of the contingency table, [a], [b], [c] and [d] are secure texts of the respective frequencies a, b, c and d, and N is an upper bound satisfying a+b+c+d≤N, the secure computation device comprises circuitry configured to: compute a secure text ([a₀], [b₀], [c₀], [d₀]) of a combination of reference frequencies (a₀, b₀, c₀, d₀) which are integers satisfying a₀+b₀=a+b, c₀+d₀=c+d, a₀+c₀=a+c, and b₀+d₀=b+d; determine integers h₀ and h₁ satisfying h₀≤h₁; and compute [a_(i)]=[a₀]+i, [b_(i)]=[b₀]−i, [c_(i)]=[c₀]−i and [d_(i)]=[d₀]+i for i=h₀, . . . , h₁, and obtain a set S={([a_(i)], [b_(i)], [c_(i)], [d_(i)])}_(i) of secure texts of combinations of frequencies (a_(i), b_(i), c_(i), d_(i)).
 6. A secure computation method, wherein it is assumed that a, b, c and d are non-negative integers, a is a frequency on a first row and a first column of a 2×2 contingency table, b is a frequency on the first row and a second column of the contingency table, c is a frequency on a second row and the first column of the contingency table, d is a frequency on the second row and the second column of the contingency table, [a], [b], [c] and [d] are secure texts of the respective frequencies a, b, c and d, and N is an upper bound satisfying a+b+c+d≤N, the secure computation method comprising: computing a secure text ([a₀], [b₀], [c₀], [d₀]) of a combination of reference frequencies (a₀, b₀, c₀, d₀) which are integers satisfying a₀+b₀=a+b, c₀+d₀=c+d, a₀+c₀=a+c, and b₀+d₀=b+d by circuitry of a secure computation device, determining integers h₀ and h₁ satisfying h₀≤h₁ by the circuitry of the secure computation device, and computing [a_(i)]=[a₀]+i, [b_(i)]=[b₀]−i, [c_(i)]=[c₀]−i and [d_(i)]=[d₀]+i for i=h₀, . . . , h₁, and obtaining a set S={([a_(i)], [b_(i)], [c_(i)], [d_(i)])}_(i) of secure texts of combinations of frequencies (a_(i), b_(i), c_(i), d_(i)) by the circuitry of the secure computation device.
 7. (canceled)
 8. A non-transitory computer readable medium including computer executable instructions that make a secure computation device perform a method, wherein it is assumed that a, b, c and d are non-negative integers, a is a frequency on a first row and a first column of a 2×2 contingency table, b is a frequency on the first row and a second column of the contingency table, c is a frequency on a second row and the first column of the contingency table, d is a frequency on the second row and the second column of the contingency table, [a], [b], [c] and [d] are secure texts of the respective frequencies a, b, c and d, and N is an upper bound satisfying a+b+c+d<N, the method comprising: computing a secure text ([a₀], [b₀], [c₀], [d₀]) of a combination of reference frequencies (a₀, b₀, c₀, d₀) which are integers satisfying a₀+b₀=a+b, c₀+d₀=c+d, a₀+c₀=a+c, and b₀+d₀=b+d, determining integers h₀ and h₁ satisfying h₀≤h₁; and computing [a_(i)]=[a₀]+i, [b_(i)]=[b₀]−i, [c_(i)]=[c₀]−i and [d_(i)]=[d₀]+i for i=h₀, . . . , h₁, and obtaining a set S={([a_(i)], [b_(i)], [c_(i)], [d_(i)])}_(i) of secure texts of combinations of frequencies (a_(i), b_(i), c_(i), d_(i)). 